Welcome![Sign In][Sign Up]
Location:
Search - graph cut

Search list

[matlabGrTheory

Description: GrTheory - Graph Theory Toolbox. Functions: grBase - find all bases of digraph grCoBase - find all contrabases of digraph grCoCycleBasis - find all independent cut-sets for a connected graph grColEdge - solve the color problem for graph edges grColVer - solve the color problem for graph vertexes grComp - find all components of graph-GrTheory - Graph Theory Toolbox. Functions: grBase - find all bases of digraph grCoBase - find all contrabases of digraph grCoCycleBasis - find all independent cut-sets for a connected graph grColEdge - solve the color problem for graph edges grColVer - solve the color problem for graph vertexes grComp - find all components of graph
Platform: | Size: 34816 | Author: Mohsen | Hits:

[3D GraphicGRAPH_CUT_STEREO_AA

Description: 全局立体匹配一直是一个比较困难的问题,本算法通过C++编译器,实现了全局立体匹配算法,希望对你有帮助-Stereo matching algorithm based on graph cuts, using the maximum flow/minimum cut methods to achieve global stereo matching.
Platform: | Size: 6223872 | Author: gongwenbiao | Hits:

[Othermaxflowmincut

Description: 基于图论的图像分割——最大流最小割算法。内含最大流最小割算法通用matlab程序。-Maximum flow minimum cut algorithm- based on graph theory image segmentation. Maximum flow minimum cut algorithm contains generic matlab program.
Platform: | Size: 620544 | Author: caidb | Hits:

[Special EffectsEdge-Detection

Description: 与以往关注图像局部特征和局部连续性的方法不同,本文中的方法能够提取关于图像的全局印象。为此,我们将图像分割问题转化为图划分问题并提出了划分中的一种全局判别准则——Ncut (Normalized Cut)-Concerned with the past image local characteristics and continuity of local methods, the methods herein can extract images on the overall impression. To this end, we will be transformed into the image segmentation graph partitioning problem and propose a division of a global criterion- Ncut (Normalized Cut)
Platform: | Size: 25600 | Author: 朱健 | Hits:

[Software EngineeringmodDRF.pdf

Description: In this paper we present Discriminative Random Fields (DRF), a discrim- inative framework for the classification of natural image regions by incor- porating neighborhood spatial dependencies in the labels as well as the observed data. The proposed model exploits local discriminative models and allows to relax the assumption of conditional independence of the observed data given the labels, commonly used in the Markov Random Field (MRF) framework. The parameters of the DRF model are learned using penalized maximum pseudo-likelihood method. Furthermore, the form of the DRF model allows the MAP inference for binary classifica- tion problems using the graph min-cut algorithms. The performance of the model was verified on the synthetic as well as the real-world images. The DRF model outperforms the MRF model in the experiments.
Platform: | Size: 151552 | Author: asdf12341234 | Hits:

[Special EffectsNcutImage

Description: Normalized Cut Image Segmentation Code,一种基于图的图像分割算法源代码,效果较好,但运行速度不是很高,可供图像分割初学者学习-Normalized Cut Image Segmentation Code, a graph based image segmentation algorithm
Platform: | Size: 79872 | Author: 陈健 | Hits:

[CSharpStoer-Wagner

Description: 一个新的求图的最小割的方法,Stoer-Wagner能够求得最佳分割方式,而且其速度很快。 -A new method for the minimum cut of the graph, Stoer-Wagner is able to get the best segmentation method, and its speed is very fast.
Platform: | Size: 3072 | Author: 三度空间 | Hits:

[Special EffectsLazy_Grab_cut

Description: grab_cut,graph gut的进阶版,运用了lazy snapping-There are advanced segmentation algorithms in the literature which extends the concepts of graph cuts. Most prominent of them are Graph cuts and Lazy Snapping. Lazy napping is an interactive image cut out tool. Lazy Snapping separates coarse and fine scale processing, making object specification and detailed adjustment easy.
Platform: | Size: 3011584 | Author: 皮梦婷 | Hits:

[Special EffectsFindArt

Description: 求无向连通图的最小割点。用R.Tarjan发明的算法来实现的。该算法能够求出无向连通图中最小割点。-Seeking connected undirected graph minimum cut point. Algorithmically R.Tarjan invention to achieve. The algorithm can be obtained connected undirected graph minimum cut points.
Platform: | Size: 1024 | Author: 相知无悔 | Hits:

[OtherOpenSceneGraph

Description: OpenSceneGraph(OSG)是一个基于工业图形标准OpenGL的高层次图形开发APl接口,一款开放源代码的、具备商业级别渲染能力的实时三维渲染引擎,在国内外均已得到广泛的应用,并且已经有越来越多的虚拟现实行业开发者加入到OSG开发的行列中来。 本书的编写目的是:详细剖析OpenSceneGraph引擎的实现流程,包括其场景图形结构,几何体绘制和渲染状态的封装机制,场景漫游、交互和动画的实现方式,以及最为重要的对于三维渲染引擎的内部裁减、数据动态调度和多线程渲染机制的深入分析。本书对虚拟现实行业的爱好者和从业者、对愿意了解最新图形学相关技术发展,以及有志于开发自主知识产权的三维引擎系统的读者,均会大有助益。 本书可以作为计算机图形学或虚拟现实专业的高年级本科生和研究生教材使用,也可供三维图形学领域的专门研发人员,尤其是使用0penSceneGraph进行项目开发和科学研究的人员参考、学习。-OpenSceneGraph (OSG) is a development based on industry standard OpenGL graphics APl high-level graphical interfaces, an open source, commercial-grade rendering capabilities with real-time 3D rendering engine, at home and abroad have been widely used, and has been more and more virtual reality industry developers to join the ranks OSG developed in the past. Write the purpose of this book is: a detailed analysis of OpenSceneGraph engine implementation process, including its scene graph structure, geometry rendering and encapsulation mechanism rendering state, the scene roaming implementation interaction and animation, as well as the most important for the three-dimensional rendering engine inside cut, in-depth analysis of data and multi-threaded rendering dynamic scheduling mechanism. Book industry virtual reality enthusiasts and practitioners of related graphics are willing to learn about the latest technological developments, as well as interested in the development of three-dimensio
Platform: | Size: 23246848 | Author: 苏尼玛 | Hits:

[OpenCVqiege

Description: 找到图形中的轮廓 并以轮廓切割图形并分别显示出来-Find the outline of the graph and cut it with the outline.
Platform: | Size: 1024 | Author: 啦啦 | Hits:

[Othercut_image_into_9_part

Description: 将一张图片等分成若干小份,首先导入图片转换成矩阵,截取矩阵,生成图片-Cut a graph into nine small graphs
Platform: | Size: 1024 | Author: sudazhch | Hits:

[matlabsimulated annealing algorithm

Description: 模拟退火算法的应用很广泛,可以较高的效率求解最大截问题(Max Cut Problem)、0-1背包问题(Zero One Knapsack Problem)、图着色问题(Graph Colouring Problem)、调度问题(Scheduling Problem)等等。(Simulated annealing algorithm is widely used, can be more efficient to solve the maximum Problem Cut (Max), 0-1 knapsack problem, graph coloring problems, scheduling problems, and so on.)
Platform: | Size: 62464 | Author: 四姑娘 | Hits:

[Data structsGrTheory

Description: 多种图论算法的matlab实现 例如:% ntest=1 - grBase求有向图的基 % ntest=2 - grCoBase求有向图的逆基 % ntest=3 - grCoCycleBasis求连通图的基本割集 % ntest=4 - grColEdge图的边着色(边染色) % ntest=5 - grColVer图的点着色(节点染色)(% grBase - find all bases of digraph; % grCoBase - find all contrabases of digraph; % grCoCycleBasis - find all independent cut-sets for a connected graph; % grColEdge - solve the color problem for graph edges;)
Platform: | Size: 34816 | Author: 深藏功与名1 | Hits:

[matlab枝切法和质量图法相位解缠

Description: 利用枝切法和质量图法引导相位解缠,可用于InSAR数据处理(Phase unwrapping guided by branch-cut method and mass graph method)
Platform: | Size: 41984 | Author: yttttt | Hits:
« 1 2 ... 9 10 11 12 13 14»

CodeBus www.codebus.net